Scheduling Algorithms for Input-Queued Switches: Randomized Techniques and Experimental Evaluation
نویسندگان
چکیده
A basic problem faced by designers of high-bandwidth switches and routers is to provide effective techniques for scheduling the routing of cells through crossbars. The problem is particularly important under heavy loads or when quality-of-service (QoS) is to be supported. Much previous work on scheduling has focused on maximum bipartite matching (MBM), maximum weight bipartite matching (MWBM), and heuristics to approximate MBM and MWBM solutions. In this paper, we introduce the Shakeup technique: a randomized approach that can be used in conjunction with a number of existing heuristics to substantially improve solution quality. The Shakeup approach is conceptually simple and is supported by both theoretical and experimental results. In addition, this paper provides for the first time a framework for experimental scheduler analysis. We give extensive head-to-head comparisons of stability ranges for a number of previously proposed schedulers, and work towards the development of benchmark traffic types.
منابع مشابه
Packet Scheduling in Input-Queued Cell-Based Switches
Input-queued switch architectures play a major role in the design of high performance switches and routers for packet networks. These architectures must be controlled by a scheduling algorithm, which solves contentions in the transfer of data units from inputs to outputs. Several scheduling algorithms were proposed in the literature for input-queued cell switches, operating on fixed-size data u...
متن کاملStable local scheduling policies in networks of input-queued switches
Most research on switch architectures and scheduling algorithms has focused on single switches. It is well known that certain scheduling policies that are based on maximum weight matching algorithms guarantee the stability of single switches. However, recent research has shown that most of these scheduling policies do not guarantee the stability of networks of input-queued switches. So far, onl...
متن کاملScheduling reserved traffic in input-queued switches: New delay bounds via probabilistic techniques
We consider the problem of providing delay bounds to reserved traffic in high-speed input-queued switches. We assume that the matrix of bandwidth demands is known and we use the now standard approach of decomposing this matrix into a convex combination of permutation matrices. Our problem therefore reduces to the problem of constructing a schedule for these permutation matrices. In this paper w...
متن کاملA Framework for Evaluating Fairness in Input-Queued Switches: Fundamental Principles and Practical Strategies
Fairness in traffic management can improve the isolation between traffic streams, offer a more predictable performance, eliminate transient bottlenecks, mitigate the effect of certain kinds of denial-of-service attacks, and serve as a critical component of a quality-of-service strategy to achieve certain guaranteed services such as delay bounds and minimum bandwidths. Several research efforts h...
متن کاملStable Round-Robin Scheduling Algorithms for High-Performance Input Queued Switches
High-performance input-queued switches require highspeed scheduling algorithms while maintaining good performance. Various round-robin scheduling algorithms for Virtual Output Queuing (VOQ) crossbar-based packet switch architectures have been proposed. It has been demonstrated that they can operate at high speed (e.g., OC192), and are relatively simple to implement in hardware. In particular, a...
متن کامل